Ant colony approaches for multiobjective structural optimization problems with a cardinality constraint

Two Ant Colony Optimization algorithms are proposed to tackle multiobjective structural optimization problems with an additional constraint. A cardinality constraint is introduced in order to limit the number of distinct values of the design variables appearing in any candidate solution. Such constraint is directly enforced when an ant builds a candidate solution, while the other mechanical constraints are handled by means of an adaptive penalty method (APM). The test-problems are composed by structural optimization problems with discrete design variables, and the objectives are to minimize both the structure’s weight and its maximum nodal displacement. The Pareto sets generated in the computational experiments are evaluated by means of performance metrics, and the obtained designs are also compared with solutions available from single-objective studies in the literature.     

Bayesian estimation of parametric uncertainties,quantification and reduction using optimal design of experiments for CO2 adsorption on amine sorbents

Uncertainty quantification plays a significant role in establishing reliability of mathematical models, while applying to process optimization or technology feasibility studies. Uncertainties, in general, could occur either in mathematical model or in model parameters. In this work, process of CO₂ adsorption on amine sorbents, which are loaded in hollow fibers is studied to quantify the impact of uncertainties in the adsorption isotherm parameters on the model prediction. The process design variable that is most closely related to the process economics is the CO₂ sorption capacity, whose uncertainty is investigated. We apply Bayesian analysis and determine a utility function surface corresponding to the value of information gained by the respective experimental design point. It is demonstrated that performing an experiment at a condition with a higher utility has a higher reduction of design variable prediction uncertainty compared to choosing a design point at a lower utility.     

MCMC algorithms for Subset Simulation

Subset Simulation is an adaptive simulation method that efficiently solves structural reliability problems with many random variables. The method requires sampling from conditional distributions, which is achieved through Markov Chain Monte Carlo (MCMC) algorithms. This paper discusses different MCMC algorithms proposed for Subset Simulation and introduces a novel approach for MCMC sampling in the standard normal space. Two variants of the algorithm are proposed: a basic variant, which is simpler than existing algorithms with equal accuracy and efficiency, and a more efficient variant with adaptive scaling. It is demonstrated that the proposed algorithm improves the accuracy of Subset Simulation, without the need for additional model evaluations.     

Permanent magnet DC motor parameters estimation via universal adaptive stabilization

This paper presents a quick and effective adaptive estimation methodology for parameters estimation of a permanent magnet (PM) DC motor. The proposed technique uses a universal adaptive stabilizer (UAS). This technique estimates PMDC motor parameters in a single experimental run using input voltage, current and speed. Over time, due to aging and wear, a motor’s parameters values do not match those in the datasheet. Mathematical proofs, experimental results supporting the proposed approach are presented. Despite the persistence of excitation condition not being imposed, the proposed technique produces good results, and is verified in earlier work on Li-ion battery parameters estimation.     

USAD: undetectable steganographic approach in DCT domain

In this work, we propose a new adaptive chaotic steganographic method based on the Discrete Cosine Transform (DCT) and a reversible mapping function. The mapping function is used to map the secret bits into their corresponding symbols. This mapping technique has to preserve the same dynamics, properties and distribution of the original DCT coefficients. The novelty of our approach is based on the adaptive selection phase of embedding spots. This selection is established through a blindness condition which is applied over each image of the database. The proposed embedding scheme within the middle DCT coefficients shows lower probability of detection and higher flexibility in extraction. We evaluate the detection of our method using the Ensemble Classifiers and a set of frequency and spatial domain feature extractors such as the Spatial domain Rich Model (SRM) features, Chen et al.'s 486-dimensional both inter- and intra-block Markov-based features and Liu's 216-dimensional adaptive steganography-based features.     

基于HOG和SVM的双眼虹膜图像的人眼定位算法

针对近红外光下现有的人眼定位算法普遍存在准确性不高、泛化能力不佳等问题，提出了一种基于方向梯度直方图（HOG）和支持向量机（SVM）相结合的双眼虹膜图像的人眼定位算法。利用HOG提取虹膜图像的人眼特征，并结合SVM分类器对HOG特征进行训练从而实现人眼的精确定位。为了减少漏检和误检，进一步提高定位准确率，又提出了多级级联SVM分类器算法；另外针对近红外光线下虹膜图像独特的灰度分布特点，设计了一种图像预处理方法，能够显著提高人眼定位速度。在MIR2016和CASIA-IRIS-Distance数据集上的实验结果表明，基于HOG和SVM的双眼虹膜图像的人眼定位算法具有高准确率、强泛化能力和高实时性。     

Minimizing sum of the due date assignment costs,maximum tardiness and distribution costs in a supply chain scheduling problem

In production systems, manufacturers face important decisions that affect system profit. In this paper, three of these decisions are modelled simultaneously: due date assignment, production scheduling, and outbound distribution scheduling. These three decisions are made in the sales, production planning and transportation departments. Recently, many researchers have devoted attention to the problem of integrating due date assignment, production scheduling and outbound distribution scheduling. In the present paper, the problems of minimizing costs associated with maximum tardiness, due date assignment and delivery for a single machine are considered. Mixed Integer Non-Linear Programming (MINLP) and a Mixed Integer Programming (MIP) are used for the solution. This problem is NP-hard, so two meta-heuristic algorithms, an Adaptive Genetic Algorithm (AGA) and a Parallel Simulated Annealing algorithm (PSA), are used for solution of large-scale instances. The present paper is the first time that crossover and mutation operators in AGA and neighbourhood generation in PSA have been used in the structure of optimal solutions. We used the Taguchi method to set the parameters, design of experiments (DOE) to generate experiments, and analysis of variance, the Friedman, Aligned Friedman, and Quade tests to analyse the results. Also, the robustness of the algorithms was addressed. The computational results showed that AGA performed better than PSA.     

Segment dependent dynamic multi-histogram equalization for image contrast enhancement

Histogram equalization (HE) method proved to be a simple and most effective technique for contrast enhancement of digital images. However it does not preserve the brightness and natural appearance of the images, which is a major drawback. To overcome this limitation, several Bi- and Multi-HE methods have been proposed. Although the Bi-HE methods significantly enhance the contrast and may preserve the brightness, the natural appearance of the images is not preserved as these methods suffer with the problem of intensity saturation. While Multi-HE methods are proposed to further maintain the brightness and natural appearance of images, but at the cost of contrast enhancement. In this paper, two novel Multi-HE methods for contrast enhancement of natural images, while preserving the brightness and natural appearance of the images, have been proposed. The technique involves decomposing the histogram of an input image into multiple segments based on mean or median values as thresholds. The narrow range segments are identified and are allocated full dynamic range before applying HE to each segment independently. Finally the combined equalized histogram is normalized to avoid the saturation of intensities and un-even distribution of bins. Simulation results show that, for the variety of test images (120 images) the proposed method enhances contrast while preserving brightness and natural appearance and outperforms contemporary methods both qualitatively and quantitatively. The statistical consistency of results has also been verified through ANOVA statistical tool.     

Adaptive burnup stepsize selection using control theory for 2-D lattice depletion simulations

A control theory approach is adopted to determine the temporal discretization during two-dimensional lattice physics depletion simulations. Two primary applications of automated and adaptive stepsize control are identified: (i) the presence of strong absorbers such as gadolinium, where the accurate burnout of the isotopes requires a depletion stepsize smaller than typically required, and (ii) high fidelity multiphysics simulations, e.g. loosely coupled physics, where the coupled physics are nonlinear in time and stepsize changes may be necessary to obtain an accurate coupled solution. A conventional predictor–corrector method is used to address the nonlinearity of the nuclide transmutation and neutron flux. An adaptive stepsize method is developed based on monitoring the one-group scalar neutron flux at both the predictor and corrector steps to approximate the convergence residual of the nonlinear solution. A user-specified tolerance on the L² relative error norm of the scalar neutron flux is utilized by the stepsize controller. Controllers that include integral, proportional, and/or derivative components are investigated and parameterized using Latin hypercube sampling of the controller input parameters. Three distinct fuel loadings of pressurized water reactor 17 × 17 fuel pin assemblies are considered, including no burnable absorbers, Integral Fuel Burnable Absorber, and gadolinium fuel pins. The required depletion stepsizes, as predicted throughout the cycle by the controller, are compared with a very small stepsize (0.01 MW d/kgHM) reference solution and a solution obtained by a typical rule of thumb depletion stepsize sequence.